Optimized distributed Goppa codes based on spatial modulation

نویسندگان

چکیده

The distributed Goppa coded spatial modulation (DGC-SM) scheme is proposed in cooperative scenarios. In the DGC-SM scheme, relay chooses partial information from source by using idea of selection, and then re-encodes selected information. At destination, a code obtained corresponding to each selection. order get best possible code, an optimal selection algorithm at relay. algorithm, all selections message sequences are considered, which results high complexity. Thus, another optimized with low complexity To further enhance capability information, two efficient joint decoding algorithms called smart improved proposed. Moreover, bit error rate (BER) performance bound derived. Through simulations, effectiveness confirmed. Also, it observed that simulation analytical closely match signal-to-noise ratio (SNR).

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Notes on Goppa Codes

Ideas from algebraic geometry became useful in coding theory after Goppa’s construction [7]. He had the beautiful idea of associating to a (projective, geometrically irreducible, non-singular, algebraic) curve X defined over Fq, the finite field with q elements, a code C. This code is constructed from two divisors D and G on X , where one of them, say D, is the sum of n distinct Fq-rational poi...

متن کامل

On GAG-Codes and Geometric Goppa Codes

We investigate a relation between generalized algebraic geometry codes and geometric Goppa codes. We also propose a decoding method for algebraic geometry codes.

متن کامل

Goppa codes

Absfruct-Goppa described a new class of linear noncyclic errorcorrecting codes in [l] and [2]. This paper is a summary of Goppa’s work, which is not yet available in English.’ We prove the four most important properties of Goppa codes. 1) There exist q-ary Goppa codes with lengths and redundancies comparable to BCH codes. For the same redundancy, the Goppa code is typically one digit longer. 2)...

متن کامل

Generating Goppa Codes

Once quantum computers become operational all current public key crypto systems, PKCSs become obsolete. Fortunately, there are alternative quantum computer robust methods based on coding, on hashing, on multivariate polynomials, on lattices etc. One such candidate is the McEliece PKCS which is based on error correcting codes, e.g. Goppa codes. Hence, in order to implement the McEliece PKCS one ...

متن کامل

Efficient Decoding Methods in Goppa codes based on Klein Curves

The use of Algebraic curves in coding theory provides a great deal of flexibility. The rate of encoding and decoding of codes depends greatly on its construction. In this research report we will establish the mathematical basis for coding theory, algebraic curves and encoding and decoding techniques which improve the performance of coding systems. We will also investigation two different Klein ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Iet Communications

سال: 2023

ISSN: ['1751-8636', '1751-8628']

DOI: https://doi.org/10.1049/cmu2.12634